Characterization of Locality Aware Task Scheduling Mechanism

The architectural features of modern computers highlight the need of parallel programming for sustained performance. This paper deals with task based programming to program modern computers. Due to lack of data locality, communication optimization and lack of task characterization support in an existing task scheduling, we intends to overview the characterization of locality aware task scheduling technique which exploits home cache locality on many-core processors. Scheduling task oblivious to the locality of home caches introduces a performance bottlenecks. This paper presents a scheduling technique where runtime system controls the assignment of home caches to memory blocks and schedules tasks to minimize home cache access penalties. Various programming models supports constructs for task based parallelism like openMP, Cilk Plus [1] and Wool etc.. Explicit parallelization is required to obtain high performance on modern computer architectures. KeywordsLocality-Aware Scheduling, Multi-core Processor, Work stealing, NUMA, Load balancing.